Approximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions Approximation Algorithms for Facility Location Problems with Discrete Subadditive Cost Functions

In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1 + , 1)-reduction of the facility location problem with subadditive costs to a soft capacitated facility location problem, which implies the existence of a 2(1 +) approximation algorithm. For a special subclass of subadditive functions, we obtain a 2-approximation algorithm by reduction to the linear cost facility location problem.